Uniform random sampling of planar graphs in linear time
نویسندگان
چکیده
منابع مشابه
Uniform random sampling of planar graphs in linear time
This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic description of the g...
متن کاملThe Evolution of Uniform Random Planar Graphs
Let Pn,m denote the graph taken uniformly at random from the set of all planar graphs on {1, 2, . . . , n} with exactly m(n) edges. We use counting arguments to investigate the probability that Pn,m will contain given components and subgraphs, finding that there is different asymptotic behaviour depending on the ratio mn .
متن کاملSampling Geometric Inhomogeneous Random Graphs in Linear Time
Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry. This is why the focus of the literature on theoretical models for real-world networks shifted from classic models without geometry, such as Chung-Lu random graphs, to modern geometry-based models...
متن کاملUniform Linear Embeddings of Spatial Random Graphs
In a random graph with a spatial embedding, the probability of linking to a particular vertex v decreases with distance, but the rate of decrease may depend on the particular vertex v, and on the direction in which the distance increases. In this article, we consider the question when the embedding can be chosen to be uniform, so the probability of a link between two vertices depends only on th...
متن کاملLinear-Time Generation of Random Chordal Graphs
Chordal graphs form one of the most well studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of problems among the latter, approximation algorithms, parameterized algorithms, and algorithms with moderately exponential or sub-exponential running time have been designe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2009
ISSN: 1042-9832
DOI: 10.1002/rsa.20275